Management and Placement of Replicas in a Hierarchical Data Grid
نویسندگان
چکیده
منابع مشابه
Management and Placement of Replicas in a Hierarchical Data Grid
In large systems, data management is only possible through the use of replication techniques. In order to improve availability and ensure fast and efficient access, we propose in this paper a dynamic replication algorithm which takes into account also the placement of data in a hierarchical data grid. Experimental results show the effectiveness of our approach in terms of response time and avai...
متن کاملA Hybrid Protocol for Replicas Management in Data Grid
In large scale distributed systems, replication is a popular technique for improving the accessibility of information and surviving the unreliability of communication networks. Pessimistic replication and optimistic replication are two contrasting replication models. They represent the two extremes in the availability-consistency. Pessimistic replication favors consistency over availability, wh...
متن کاملConsistency Management of Replicas in Wireless Grid Environment
In a wireless network, an user has the possibility of remaining link while moving in a more or less spread geographical perimeter, it is the reason for which they intend to sometimes speak about "mobility". The wireless Grid represent a new type of network of distribution of means linking up mobile phones and other implements of edge some with the others with different access points. In this ar...
متن کاملNegotiation Mechanisms for Resolution Conflicts among Replicas in Data Grid
Data Grid environment seek to harness geographically distributed resources that deal with data-intensive problems such as those encountered in high energy physics, bio-informatics, and other disciplines. In general, grids enable the efficient sharing and management of computing resources for the purpose of performing large complex tasks. To be able to sharing data, it is recommended to use the ...
متن کاملJoin Algorithm Using Multiple Replicas in Data Grid
We address the issue of applying join operation to the relational data managed in the form of multiple replicas in data grid. A join algorithm is developed that solves the problem of replica matching and execution node selection by making use of matching theory. To ease the data transference among the grid nodes, we introduce relation reduction and row blocking techniques. The analytical and ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Distributed and Parallel systems
سال: 2011
ISSN: 2229-3957
DOI: 10.5121/ijdps.2011.2603